Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method
نویسندگان
چکیده
منابع مشابه
Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method
The process scheduling, is one of the most important tasks of the operating system. One of the most common scheduling algorithms used by the most operating systems is the Round Robin method in which, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice) circularly. In this paper, a nonlinear programming mathematical model...
متن کاملAn Optimum Time Quantum Using Linguistic Synthesis for Round Robin Scheduling Algorithm
In Round Robin CPU scheduling algorithm the main concern is with the size of time quantum and the increased waiting and turnaround time. Decision for these is usually based on parameters which are assumed to be precise. However, in many cases the values of these parameters are vague and imprecise. The performance of fuzzy logic depends upon the ability to deal with Linguistic variables. With th...
متن کاملStatistical Approach to Determine Most Efficient Value for Time Quantum in round Robin Scheduling
Scheduling various processes is one of the most fundamental functions of the operating system. In that context one of the most common scheduling algorithms used in most operating systems is the Round Robin method in which, the ready processes waiting in the ready queue, take control of the processor for a short period of time known as the time quantum (or time slice) circularly. Here we discuss...
متن کاملSimulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm
CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in timeshared systems, but it performs more number of context switches, larger waiting time and larger response time. The devised tool “OMDRRS” was utilized to simulate the four algorithms (FCFS, SJF, ROUND ROBIN & Proposed Dynamic Round Robin Algorithm) u...
متن کاملAn Optimum Multilevel Dynamic Round Robin Scheduling Algorithm
The main objective of this paper is to improve the Round Robin scheduling algorithm using the dynamic time slice concept. CPU scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. CPU scheduling has strong effect on resource utilization as well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology and Computer Science
سال: 2012
ISSN: 2074-9007,2074-9015
DOI: 10.5815/ijitcs.2012.10.08